Excluding the Middle
نویسندگان
چکیده
منابع مشابه
Excluding infinite minors
Robertson, N., P. Seymour and R. Thomas, Excluding infinite minors, Discrete Mathematics 95 (1991) 303-319. Let K be an infinite cardinal, and let H be either a complete graph with K vertices, or a tree in which every vertex has valency K. What can we say about graphs G which (i) have no minor isomorphic to H, or (ii) contain no sub graph which is a subdivision of H? These four questions are an...
متن کاملExcluding a Countable Clique
We extend the excluded Kn minor theorem of Robertson and Seymour to infinite graphs, and deduce a structural characterization of the infinite graphs that have no Kא0 minor. The latter is a refinement of an earlier characterization of Robertson, Seymour and the second author.
متن کاملFractures of the Carpal Bones Excluding
Carpal fractures excluding the scaphoid can cause morbidity that is disproportionate to their incidence because they are easily overlooked and are often harbingers of a wider wrist injury. Failure to recognize a more global injury pattern can result in undertreatment and permanent wrist dysfunction. Diagnosis requires a high index of suspicion, familiarity with carpal topography to guide the ph...
متن کاملExcluding induced subgraphs
Given two graphs, G and H, we say that H is an induced subgraph of G if V (H) ⊆ V (G), and two vertices of H are adjacent if and only if they are adjacent in G. Let F be a (possibly infinite) family of graphs. A graph G is called F -free if no member of F is isomorphic to an induced subgraph of G. A clique in a graph is a set of vertices all pairwise adjacent, and a stable set is a set of verti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Crítica (México D. F. En línea)
سال: 1988
ISSN: 1870-4905,0011-1503
DOI: 10.22201/iifs.18704905e.1988.682